BST Search - Code

def search(node, key):
    # Base case: empty subtree
    if node is None:
        return None

    # Key found
    if key == node.key:
        return node

    # Recur down the tree
    if key < node.key:
        return search(node.left, key)
    else:
        return search(node.right, key)